Reversibility in Asynchronous Cellular Automata
نویسندگان
چکیده
The reversibility issue of one-dimensional asynchronous cellular automata (ACAs) is addressed in this paper. The cells of ACAs are updated independently. The cellular automata (CAs) rules are classified as reversible and irreversible rules. The irreversible rules cannot configure reversible ACAs. The reversible rules may configure reversible ACAs depending upon the update of ACA cells. Finally, an algorithm is developed that outputs a sequence of ACA cells for a given CA rule to be updated to generate a cycle for a reversible ACA.
منابع مشابه
Phase Space Invertible Asynchronous Cellular Automata
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating ...
متن کاملرمزنگاری تصاویر با استفاده از اتوماتای سلولی برگشت پذیر
In this paper, a new structure for image encryption using recursive cellular automatais presented. The image encryption contains three recursive cellular automata in three steps, individually. At the first step, the image is blocked and the pixels are substituted. In the next step, pixels are scrambledby the second cellular automata and at the last step, the blocks are attachedtogether and the ...
متن کاملارائه روشی برای رمزنگاری تصاویر با استفاده از اتوماتای سلولی ترکیبی
In this paper, a new structure for image encryption using hybrid cellular automata is presented. The image encryption is done in two steps. At the first step, each pixel is encrypted by rules of hybrid cellular automata. In the next step, each pixel converted to a binary number and each bit is encrypted by rules of cellular automata. The rules are made by a function. Due to reversibility of cel...
متن کاملReversible Computation in Asynchronous Cellular Automata
Reversible computation has attracted much attention over the years, not only for its promise for computers with radically reduced power consumption, but also for its importance for Quantum Computing. Though studied extensively in a great variety of synchronous computation models, it is virtually unexplored in an asynchronous framework. Particularly suitable asynchronous models for the study of ...
متن کاملReversibility of Linear Cellular Automata on Cayley Trees with Periodic Boundary Condition
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class. This paper studies the reversibility of linear cellular automata defined on Cayley trees with periodic boundary condition, where the local rule is given by f(x0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 21 شماره
صفحات -
تاریخ انتشار 2012